Some comments on unitary qubit lattice algorithms for classical problems
نویسندگان
چکیده
$\bf{Abstract}$: A qubit lattice algorithm (QLA), which consists of a set interleaved unitary collision-streaming operators, is developed for electromagnetic wave propagation in tensor dielectric media. External potential operators are required to handle gradients the refractive indices, and these typically non-unitary. similar problem arises QLA Korteweg-de Vries equation, as operator that models KdV nonlinear term also Several QLAs presented here avoid need this non-unitary by perturbing collision operator. These fully unitary.
منابع مشابه
Some Sieving Algorithms for Lattice Problems
We study the algorithmic complexity of lattice problems based on the sieving technique due to Ajtai, Kumar, and Sivakumar [AKS01]. Given a k-dimensional subspace M ⊆ Rn and a full rank integer lattice L ⊆ Qn, the subspace avoiding problem SAP, defined by Blömer and Naewe [BN07], is to find a shortest vector in L \ M. We first give a 2O(n+k log k) time algorithm to solve the subspace avoiding pr...
متن کاملglobal results on some nonlinear partial differential equations for direct and inverse problems
در این رساله به بررسی رفتار جواب های رده ای از معادلات دیفرانسیل با مشتقات جزیی در دامنه های کراندار می پردازیم . این معادلات به فرم نیم-خطی و غیر خطی برای مسایل مستقیم و معکوس مورد مطالعه قرار می گیرند . به ویژه، تاثیر شرایط مختلف فیزیکی را در مساله، نظیر وجود موانع و منابع، پراکندگی و چسبندگی در معادلات موج و گرما بررسی می کنیم و به دنبال شرایطی می گردیم که متضمن وجود سراسری یا عدم وجود سراسر...
Some bounds on unitary duals of classical groups - non-archimeden case
We first give bounds for domains where the unitarizabile subquotients can show up in the parabolically induced representations of classical $p$-adic groups. Roughly, they can show up only if the central character of the inducing irreducible cuspidal representation is dominated by the square root of the modular character of the minimal parabolic subgroup. For unitarizable subquotients...
متن کاملSOME COMMENTS ON THINNING ALGORITHMS FOR 3 - D IMAGESFrancisco
The problem of deening simple points in a two-dimensional binary image was extensively discussed in the literature. This deenition is more complicated for 3-d images due to the introduction of a new topological component, namely, the tunnel. Recently, some simple-point characterizations for these images have been proposed. In this paper we show the equivalences between these new characterizatio...
متن کاملFew-qubit quantum-classical simulation of strongly correlated lattice fermions
*Correspondence: [email protected] 1Clarendon Laboratory, Department of Physics, University of Oxford, Parks Road, Oxford, OX1 3PU, UK Full list of author information is available at the end of the article Abstract We study a proof-of-principle example of the recently proposed hybrid quantum-classical simulation of strongly correlated fermion models in the thermodynamic limit. In a ‘tw...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Radiation Effects and Defects in Solids
سال: 2023
ISSN: ['1029-4953', '1026-549X', '1042-0150']
DOI: https://doi.org/10.1080/10420150.2023.2186871